Search results for "Probability assessment"
showing 10 items of 13 documents
Lower and Upper Probability Bounds for Some Conjunctions of Two Conditional Events
2018
In this paper we consider, in the framework of coherence, four different definitions of conjunction among conditional events. In each of these definitions the conjunction is still a conditional event. We first recall the different definitions of conjunction; then, given a coherent probability assessment (x, y) on a family of two conditional events \(\{A|H,B|K\}\), for each conjunction \((A|H) \wedge (B|K)\) we determine the (best) lower and upper bounds for the extension \(z=P[(A|H) \wedge (B|K)]\). We show that, in general, these lower and upper bounds differ from the classical Frechet-Hoeffding bounds. Moreover, we recall a notion of conjunction studied in recent papers, such that the res…
Probabilistic Logic under Coherence‚ Model−Theoretic Probabilistic Logic‚ and Default Reasoning in System P
2016
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System P. In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System P. That is, we provide a new probabilistic semantics for System P, which neither uses infinitesimal probabilities nor atomic bound (or bi…
Probabilistic Logic under Coherence, Model-Theoretic Probabilistic Logic, and Default Reasoning
2001
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore the relationship between coherence-based and model-theoretic probabilistic logic. Interestingly, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Crucially, we even show that probabilistic reasoning under coherence is a probabilistic generalization of default reasoning in system P. That is, we provide a new probabilistic semantics for system P, which is neither based on infinitesimal probabilities nor on atomic-bound (or also big-stepped) probabil…
External photon radiation treatment for prostate cancer: Uncomplicated and cancer-free control probability assessment of 36 plans
2019
[Purpose] To perform a systematic and thorough assessment, using the Uncomplicated and Cancer-Free Control Probability (UCFCP) function, of a broad range of photon prostate cancer RT treatments, on the same scenario (a unique pelvic CT set). UCFCP considers, together with the probabilities of local tumour control (TCP) and deterministic (late) sequelae (NTCP), the second primary cancer risk (SPCR) due to photon and neutron peripheral doses.
A Decision Analysis Approach to Multiple-Choice Examinations
1998
We present a decision analysis approach to the problems faced by people subject to multiple-choice examinations, as often encountered in their education, in looking for a job, or in getting a driving permit.
Quasi conjunction and p-entailment in nonmonotonic reasoning
2010
We study, in the setting of coherence, the extension of a probability assessment defined on n conditional events to their quasi conjunction. We consider, in particular, two special cases of logical dependencies; moreover, we examine the relationship between the notion of p-entailment of Adams and the inclusion relation of Goodman and Nguyen. We also study the probabilistic semantics of the QAND rule of Dubois and Prade; then, we give a theoretical result on p-entailment.
Logical Conditions for Coherent Qualitative and Numerical Probability Assessments
2003
Efficient checking of coherence and propagation of imprecise probability assessments
2000
We consider the computational difficulties in the checking of coherence and propagation of imprecise probability assessments. We examine the linear structure of the random gain in betting criterion and we propose a general methodology which exploits suitable subsets of the set of values of the random gain. In this way the checking of coherence and propagation amount to examining linear systems with a reduced number of unknowns. We also illustrate an example.
From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events
2012
In this paper, starting from a generalized coherent (i.e. avoiding uniform loss) intervalvalued probability assessment on a finite family of conditional events, we construct conditional probabilities with quasi additive classes of conditioning events which are consistent with the given initial assessment. Quasi additivity assures coherence for the obtained conditional probabilities. In order to reach our goal we define a finite sequence of conditional probabilities by exploiting some theoretical results on g-coherence. In particular, we use solutions of a finite sequence of linear systems.
Probabilistic Logic under Coherence: Complexity and Algorithms
2005
In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…